Using DEA-neural network approach to solve binary classification problems
نویسندگان
چکیده
منابع مشابه
Using Duo Output Neural Network to Solve Binary Classification Problems
This paper proposes an approach to solve binary classification problems using Duo Output Neural Network (DONN). DONN is a neural network trained to predict a pair of complementary outputs which are the truth and falsity values. In this paper, outputs obtained from two DONNs are aggregated and used to predict the classification result. The first DONN is trained to predict a pair of truth and fal...
متن کاملA Neural Network Model to Solve DEA Problems
The paper deals with Data Envelopment Analysis (DEA) and Artificial Neural Network (ANN). We believe that solving for the DEA efficiency measure, simultaneously with neural network model, provides a promising rich approach to optimal solution. In this paper, a new neural network model is used to estimate the inefficiency of DMUs in large datasets.
متن کاملa neural network model to solve dea problems
the paper deals with data envelopment analysis (dea) and artificial neural network (ann). we believe that solving for the dea efficiency measure, simultaneously with neural network model, provides a promising rich approach to optimal solution. in this paper, a new neural network model is used to estimate the inefficiency of dmus in large datasets.
متن کاملUsing MOLP based procedures to solve DEA problems
Data envelopment analysis (DEA) is a technique used to evaluate the relative efficiency of comparable decision making units (DMUs) with multiple input-output. It computes a scalar measure of efficiency and discriminates between efficient and inefficient DMUs. It can also provide reference units for inefficient DMUs without consideration of the decision makers’ (DMs) preferences. In this paper, ...
متن کاملCompetitive neural network to solve scheduling problems
Most scheduling problems have been demonstrated to be NP-complete problems. The Hop"eld neural network is commonly applied to obtain an optimal solution in various di!erent scheduling applications, such as the traveling salesman problem (TSP), a typical discrete combinatorial problem. Hop"eld neural networks, although providing rapid convergence to the solution, require extensive e!ort to deter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Envelopment Analysis and Decision Science
سال: 2013
ISSN: 2195-4496
DOI: 10.5899/2013/dea-00002